Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(g(a)) |
→ a |
| 2: |
|
f(f(x)) |
→ b |
| 3: |
|
g(x) |
→ f(g(x)) |
|
There are 2 dependency pairs:
|
| 4: |
|
G(x) |
→ F(g(x)) |
| 5: |
|
G(x) |
→ G(x) |
|
The approximated dependency graph contains one SCC:
{5}.
-
Consider the SCC {5}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006